Adapting Differential Evolution Algorithms For Continuous Optimization Via Greedy Adjustment Of Control Parameters
نویسندگان
چکیده
منابع مشابه
Optimization of Oscillation Parameters in Continuous Casting Process of Steel Manufacturing: Genetic Algorithms versus Differential Evolution
Continuous casting is a critical step in the steel manufacturing process where molten metal is solidified in the form of slabs of rectangular cross-section. Minor variations in this step can impact the production process widely – from excellent product quality to breakdown in the production chain. In continuous casting the liquid steel from a ladle is first poured into a buffer vessel called a ...
متن کاملParallel differential evolution with self-adapting control parameters and generalized opposition-based learning for solving high-dimensional optimization problems
Solving high-dimensional global optimization problems is a time-consuming task because of the high complexity of the problems. To reduce the computational time for high-dimensional problems, this paper presents a parallel differential evolution (DE) based on Graphics Processing Units (GPUs). The proposed approach is called GOjDE, which employs self-adapting control parameters and generalized op...
متن کاملSelf-adapting control parameters modified differential evolution for trajectory planning of manipulators
Control parameters of original differential evolution (DE) are kept fixed throughout the entire evolutionary process. However, it is not an easy task to properly set control parameters in DE for different optimization problems. According to the relative position of two different individual vectors selected to generate a difference vector in the searching place, a self-adapting strategy for the ...
متن کاملA Framework for Adapting Population-Based and Heuristic Algorithms for Dynamic Optimization Problems
In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...
متن کاملOptimization I: Greedy Algorithms
In this chapter and the next, we consider algorithms for optimization problems. We have already seen an example of an optimization problem — the maximum subsequence sum problem from Chapter 1. We can characterize optimization problems as admitting a set of candidate solutions. In the maximum subsequence sum problem, the candidate solutions are the contiguous subsequences in the input array. An ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence and Soft Computing Research
سال: 2016
ISSN: 2083-2567
DOI: 10.1515/jaiscr-2016-0009